A Mathematical Programming with Equilibrium Constraints for Managing Traffic after a Major Earthquake: a Merit-function Based Approach

نویسندگان

  • Fumitaka KURAUCHI
  • Agachai SUMALEE
  • Yasunori IIDA
چکیده

This paper proposes the methodology to evaluate the road network anti-hazardous ability by the concept of network capacity reliability. The methodology proposed here considers the area-traffic regulation, which may be implemented when a large disaster occurs in Japan. The model to calculate entry permission rates is formulated as MPEC (Mathematical Programming with Equilibrium Constraints) in which the travellers are assumed to rationally respond to the imposed permission rate according to the Wardrop’s equilibrium. Also in this paper, an efficient algorithm to find a solution of MPEC problem is proposed. The proposed method transforms the original bi-level optimisation problem into a smooth single level optimisation problem by utilising the idea of merit function. The efficiencies of proposed network reliability index together with calculation methodology are discussed by the numerical experiment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimation of Concentrations in Chemical Systems at Equilibrium Using Geometric Programming

Geometric programming is a mathematical technique, which has been developed for nonlinear optimization problems. This technique is based on the dual program with linear constraints. Determination of species concentrations in chemical equilibrium conditions is one of its applications in chemistry and chemical engineering fields. In this paper, the principles of geometric programming and its comp...

متن کامل

A Merit Function Piecewise SQP Algorithm for Solving Mathematical Programs with Equilibrium Constraints∗

In this paper we propose a merit function piecewise SQP algorithm for solving mathematical programs with equilibrium constraints (MPECs) formulated as mathematical programs with complementarity constraints. Under some mild conditions, the new algorithm is globally convergent to a piecewise stationary point. Moreover if the partial MPECLICQ is satisfied at the accumulation point then the accumul...

متن کامل

A revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers

In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...

متن کامل

A Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm

In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...

متن کامل

An efficient modified neural network for solving nonlinear programming problems with hybrid constraints

This paper presents ‎‎the optimization techniques for solving‎‎ convex programming problems with hybrid constraints‎.‎ According to the saddle point theorem‎, ‎optimization theory‎, ‎convex analysis theory‎, ‎Lyapunov stability theory and LaSalle‎‎invariance principle‎,‎ a neural network model is constructed‎.‎ The equilibrium point of the proposed model is proved to be equivalent to the optima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003